A new Approach Versus Benders Decomposition in Aggregate Production Planning
Authors
Abstract:
This paper proposes a simplified solution procedure to the model presented by Akinc and Roodman. The Benders’ decomposition procedure for analyzing this model has been developed, and its shortcomings have been highlighted. Here, the special nature of the problem is exploited which allowed us to develop a new algorithm through surrogating method. The two methods are compared by several numerical examples. Computational experience with these data shows the superiority of the new approach. In addition, the required computer programs have been prepared by the authors using TURBO PASCAL 7.0 to execute the algorithm.
similar resources
Cooperative aggregate production planning: a game theory approach
Production costs in general, and workforce and inventory costs in particular, constitute a large fraction of the operating costs of many manufacturing plants. We introduce cooperative aggregate production planning as a way to decrease these costs. That is, when production planning of two or more facilities (plants) is integrated, they can interchange workforce and products inventory; thus, thei...
full textAdaptive aggregate production planning with fuzzy goal programming approach
Aggregate production planning (APP) determines the optimal production plan for the medium term planning horizon. The purpose of the APP is effective utilization of existing capacities through facing the fluctuations in demand. Recently, fuzzy approaches have been applied for APP focusing on vague nature of cost parameters. Considering the importance of coping with customer demand in different p...
full textAccelerating the Composite Power System Planning by Benders Decomposition
This paper presents an application of Benders decomposition to deal with the complexities in the simultaneous Generation Expansion Planning (GEP) and Transmission Expansion Planning (TEP). Unlike the power system operation fields of study, the power system planning methods are not expected to be fast. However, it is always preferable to speed up computations to provide more analysis options for...
full textSolving a generalized aggregate production planning problem by genetic algorithms
This paper presents a genetic algorithm (GA) for solving a generalized model of single-item resource-constrained aggregate production planning (APP) with linear cost functions. APP belongs to a class of pro-duction planning problems in which there is a single production variable representing the total production of all products. We linearize a linear mixed-integer model of APP subject to hiring...
full textUncertain aggregate production planning
Based on uncertainty theory, multiproduct aggregate production planning model is presented, where the market demand, production cost, subcontracting cost, etc., are all characterized as uncertain variables. The objective is to maximize the belief degree of obtaining the profit more than the predetermined profit over the whole planning horizon. When these uncertain variables are linear, the obje...
full textGeneration Expansion Planning Using Benders’ Decomposition and Generalized Networks
This paper presents an optimization model and its application to a generation expansion planning problem. The proposed model has a generalized network structure and is exploited effectively by Benders’ decomposition algorithm, where a master problem generates trial expansion plans and a set of subproblems compute production cost and system reliability for the trial plan. The applicability of ou...
full textMy Resources
Journal title
volume 14 issue 4
pages 351- 360
publication date 2001-11-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023